Generalized Δ–Y Exchange and k-Regular Matroids
نویسندگان
چکیده
منابع مشابه
GENERALIZED ∆ − Y EXCHANGE AND k – REGULAR MATROIDS
This paper introduces a generalization of the matroid operation of ∆ − Y exchange. This new operation, segment-cosegment exchange, replaces a coindependent set of k collinear points in a matroid by an independent set of k points that are collinear in the dual of the resulting matroid. The main theorem of the first half of the paper is that, for every field, or indeed partial field, F, the class...
متن کاملk-Regular Matroids
The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF (2) is the class of near-regular matroids. Let k be a non-negative integer. This thesis considers the class of k–regular matroids, a generalization of the last two classes. Indeed, the classes of regular and near-regular matroids coincide wi...
متن کاملA base exchange property for regular matroids
In this paper, we show that for any two bases B and B of a regular matroid, there is an element e ∈ B such that there is a unique element f ∈ B for which both (B\{e}) ∪ {f} and (B\{f}) ∪ {e} are bases of M. This solves a problem posed by White in 1980.
متن کاملOn Maximum-sized k-Regular Matroids
Let k be an integer exceeding one. The class of k–regular matroids is a generalization of the classes of regular and near-regular matroids. A simple rank–r regular matroid has the maximum number of points if and only if it is isomorphic to M(Kr+1), the cycle matroid of the complete graph on r + 1 vertices. A simple rank–r near-regular matroid has the maximum number of points if and only if it i...
متن کاملON GENERALIZED k-DIAMETER OF k-REGULAR k-CONNECTED GRAPHS
In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph on n vertices has the generalized k-diameter at most n/2 and this upper bound cannot be improved when n = 4k − 6 + i(2k − 4).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2000
ISSN: 0095-8956
DOI: 10.1006/jctb.1999.1947